# 求范围内素数
import math

a = int(input("开始数:"))
b = int(input("结尾数:"))
num = []


def is_prime(number):
    if number in range(1, 2):
        return True
    for i in range(2, number):
        if number % i == 0:
            return False
    return True


def print_prime(x, y):
    for i in range(x, y + 1):
        if is_prime(i):
            num.append(i)
        else:
            continue
    return num


aa = print_prime(a, b)
print(aa)
